Self-assembling DNA graphs

It has been shown theoretically that three dimensional graph structure and DNA self-assembly can be used to solve numerous computational problems such as 3-SAT and 3-colorability in a constant number of laboratory steps. In this assembly, junction molecules and duplex DNA molecules are the basic building blocks. This paper presents experimental results of DNA self-assembly of non regular graphs using junction molecules as vertices and duplex DNA molecules as edge connections.     

Computation by Self-assembly of DNA Graphs

Using three dimensional graph structure and DNA self-assembly we show that theoretically 3-SAT and 3-colorability can be solved in a constant number of laboratory steps. In this assembly, junction molecules and duplex DNA molecules are the basic building blocks. The graphs involved are not necessarily regular, so experimental results of self-assembling non regular graphs using junction molecules as vertices and duplex DNA molecules as edge connections are presented.